- add(T) - Method in class edu.claflin.finder.logic.PrioritySet
-
Allows additions of items that already has a copy within the set
(determined by obj.equals(obj2) ) and their subsequent replacement if
they are of lesser value than the new object as determined by the
queue's comparator.
- addCondition(Condition) - Method in class edu.claflin.finder.algo.ArgumentsBundle
-
Adds a Condition to the conditionsList.
- addCondition(Condition) - Method in class edu.claflin.finder.logic.ConditionedGraph
-
Adds a condition to the graph.
- addEdge(int, int, Object) - Method in class edu.claflin.finder.logic.Graph
-
- addEdge(String, String, Object) - Method in class edu.claflin.finder.logic.Graph
-
- addEdge(Edge) - Method in class edu.claflin.finder.logic.Graph
-
Adds an edge to the Graph.
- addEdges(List<Edge>) - Method in class edu.claflin.finder.logic.Graph
-
Adds a list of Edges to the graph.
- addEdgesBetweenAllNodesInList(ArrayList<Node>) - Method in class edu.claflin.finder.logic.Graph
-
Adds edges in between all possible pair combinations of nodes in a list
if both nodes involved are present in the graph.
- addNewNode(String) - Method in class edu.claflin.finder.logic.Graph
-
- addNode(Node) - Method in class edu.claflin.finder.logic.Graph
-
Adds a node to the graph.
- addNodes(List<Node>) - Method in class edu.claflin.finder.logic.Graph
-
Adds a list of nodes to the graph.
- addOverride - Variable in class edu.claflin.finder.logic.PrioritySet
-
Boolean indicating if newer elements with a greater compare value
should replace others.
- addPartialGraph(List<Node>, List<Edge>) - Method in class edu.claflin.finder.logic.ConditionedGraph
-
Adds a partial graph to this graph.
- addPartialGraph(List<Node>, List<Edge>) - Method in class edu.claflin.finder.logic.Graph
-
Adds a partial graph to this graph.
- addPropertyChangeListener(PropertyChangeListener) - Method in class edu.claflin.finder.algo.Algorithm
-
Adds a PropertyChangeListener.
- Algorithm - Class in edu.claflin.finder.algo
-
Abstraction of the algorithm classes used for finding subgraphs.
- Algorithm(ArgumentsBundle) - Constructor for class edu.claflin.finder.algo.Algorithm
-
Public Constructor for creating an Algorithm.
- Algorithm.GraphSortOrder - Enum in edu.claflin.finder.algo
-
- algorithms - Variable in class edu.claflin.finder.algo.Bundle
-
The
Algorithm array containing the algorithms to process graphs
with.
- args - Variable in class edu.claflin.finder.algo.Algorithm
-
The ArgumentsBundle object holding arguments for the algorithm.
- ArgumentsBundle - Class in edu.claflin.finder.algo
-
Used to supply arguments to Algorithms in a generalized manner.
- ArgumentsBundle() - Constructor for class edu.claflin.finder.algo.ArgumentsBundle
-
Constructs the ArgumentsBundle.
- ArgumentsBundle.COMMON_ARGS - Enum in edu.claflin.finder.algo
-
An enumeration containing common arguments used by the program.
- ascending - Variable in class edu.claflin.finder.logic.comp.EdgeWeightComparator
-
Indicates if the comparator should sort elements in ascending order.
- assembleMap(List<CygrouperEdge>, Map) - Method in class edu.claflin.finder.logic.cygrouper.CygrouperAssembler
-
- assmbleNodes(List<CygrouperEdge>, Map) - Method in class edu.claflin.finder.logic.cygrouper.CygrouperAssembler
-